A Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a genetic algorithm with modified crossover operator for a two-agent scheduling problem

the problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. however, most work has paid more attention to the conditionthat machines are available during planning horizon. motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. each agent aims at minimizing ...

متن کامل

A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem

The genetic algorithm with search area adaptation (GSA) has a capacity for adapting to the structure of solution space and controlling the tradeoff balance between global and local searches, even if we do not adjust the parameters of the genetic algorithm (GA), such as crossover and/or mutation rates. But, GSA needs the crossover operator that has ability for characteristic inheritance ratio co...

متن کامل

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

Guided Crossover: A New Operator for Genetic Algorithm Based Optimization

Genetic algorithms (GAs) have been extensively used in different domains as a means of doing global optimization in a simple yet reliable manner. They have a much better chance of getting to global optima than gradient-based methods which usually converge to local sub-optima. However, GAs have a tendency of getting only moderately close to the optima in a small number of iterations. To get very...

متن کامل

Guided Crossover : A New Operator for Genetic Algorithm

Genetic algorithms (GAs) have been extensively used in diierent domains as a means of doing global optimization in a simple yet reliable manner. They have a much better chance of getting to global optima than gradient based methods which usually converge to local sub optima. However, GAs have a tendency of getting only moderately close to the optima in a small number of iterations. To get very ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Industrial and Business Management

سال: 2016

ISSN: 2164-5167,2164-5175

DOI: 10.4236/ajibm.2016.66071